A local search algorithm based on chromatic classes for university course timetabling problem
نویسندگان
چکیده
منابع مشابه
A local search algorithm based on chromatic classes for university course timetabling problem
This paper presents a study for a local search algorithm based on chromatic classes for the university course timetabling problem. Several models and approaches to resolving the problem are discussed. The main idea of the approach is through a heuristic algorithm to specify the chromatic classes of a graph in which the events of the timetable correspond to the graph vertices and the set of the ...
متن کاملVariable Neighborhood Search Based Algorithm for University Course Timetabling Problem
In this paper a variable neighborhood search approach as a method for solving combinatory optimization problems is presented. A variable neighborhood search based algorithm for solving the problem concerning the university course timetable design has been developed. This algorithm is used to solve the real problem regarding the university course timetable design. It is compared with other algor...
متن کاملAn Event Grouping Based Algorithm for University Course Timetabling Problem
This paper presents the study of an event grouping based algorithm for a university course timetabling problem. Several publications which discuss the problem and some approaches for its solution are analyzed. The grouping of events in groups with an equal number of events in each group is not applicable to all input data sets. For this reason, a universal approach to all possible groupings of ...
متن کاملHarmony Search Algorithm for Curriculum-Based Course Timetabling Problem
In this paper, harmony search algorithm is applied to curriculum-based course timetabling. The implementation, specifically the process of improvisation consists of memory consideration, random consideration and pitch adjustment. In memory consideration, the value of the course number for new solution was selected from all other course number located in the same column of the Harmony Memory. Th...
متن کاملA hybrid algorithm of Harmony Search and Bees Algorithm for a University Course Timetabling Problem
This paper is concerned with the development of a new hybrid metaheuristic approach for solving a practical university course timetabling problem in Vietnam. Our hybrid method is a combination of Harmony Search (HS) algorithm and the Bees algorithm. The proposed method has been tested on 14 real-world data instances and compared with some other metaheurisitic approaches, which are Variable Neig...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Advanced Computer Research
سال: 2016
ISSN: 2249-7277,2277-7970
DOI: 10.19101/ijacr.2016.627011